|
In control system theory, the Routh–Hurwitz stability criterion is a mathematical test that is a necessary and sufficient condition for the stability of a linear time invariant (LTI) control system. The Routh test is an efficient recursive algorithm that English mathematician Edward John Routh proposed in 1876 to determine whether all the roots of the characteristic polynomial of a linear system have negative real parts. German mathematician Adolf Hurwitz independently proposed in 1895 to arrange the coefficients of the polynomial into a square matrix, called the Hurwitz matrix, and showed that the polynomial is stable if and only if the sequence of determinants of its principal submatrices are all positive.〔 (English translation “On the conditions under which an equation has only roots with negative real parts” by H. G. Bergmann in ''Selected Papers on Mathematical Trends in Control Theory'' R. Bellman and R. Kalaba Eds. New York: Dover, 1964 pp. 70–82.)〕 The two procedures are equivalent, with the Routh test providing a more efficient way to compute the Hurwitz determinants than computing them directly. A polynomial satisfying the Routh–Hurwitz criterion is called a Hurwitz polynomial. The importance of the criterion is that the roots ''p'' of the characteristic equation of a linear system with negative real parts represent solutions ''ept'' of the system that are stable (bounded). Thus the criterion provides a way to determine if the equations of motion of a linear system have only stable solutions, without solving the system directly. For discrete systems, the corresponding stability test can be handled by the Schur–Cohn criterion, the Jury test and the Bistritz test. With the advent of computers, the criterion has become less widely used, as an alternative is to solve the polynomial numerically, obtaining approximations to the roots directly. The Routh test can be derived through the use of the Euclidean algorithm and Sturm's theorem in evaluating Cauchy indices. Hurwitz derived his conditions differently. ==Using Euclid's algorithm== The criterion is related to Routh–Hurwitz theorem. Indeed, from the statement of that theorem, we have where: * ''p'' is the number of roots of the polynomial ''ƒ''(''z'') with negative Real Part; * ''q'' is the number of roots of the polynomial ''ƒ''(''z'') with positive Real Part (let us remind ourselves that ''ƒ'' is supposed to have no roots lying on the imaginary line); * ''w''(''x'') is the number of variations of the generalized Sturm chain obtained from and (by successive Euclidean divisions) where for a real ''y''. By the fundamental theorem of algebra, each polynomial of degree ''n'' must have ''n'' roots in the complex plane (i.e., for an ''ƒ'' with no roots on the imaginary line, ''p'' + ''q'' = ''n''). Thus, we have the condition that ''ƒ'' is a (Hurwitz) stable polynomial if and only if ''p'' − ''q'' = ''n'' (the proof is given below). Using the Routh–Hurwitz theorem, we can replace the condition on ''p'' and ''q'' by a condition on the generalized Sturm chain, which will give in turn a condition on the coefficients of ''ƒ''. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Routh–Hurwitz stability criterion」の詳細全文を読む スポンサード リンク
|